... simple polyhedron 简单多面体 integer polyhedron 整数多面体 polyhedron simplification 多面体简化 ...
基于76个网页-相关网页
Just know that the optimal solution for a non-integer problem is always one of the polyhedron vertices.
我们只需要知道非整型问题的优化解决方案通常都是一个多面体的顶点就好了。
In other words, the feasible region is not a polyhedron; it's composed only of the integer (x1, x2,..., xn) pairs inside or at the boundaries of the actual polyhedron of the relaxed problem.
换而言之,可行域不是一个多面体;它是由这个多面体或放松限制问题的实际多面体边界中的一些整数(x1、x 2、…、xn)对。
应用推荐